大花无柱兰遗传多样性的SRAP标记分析

大花无柱兰是一种珍稀兰科植物,具有一定的观赏和药用价值,但数量十分稀少,该物种亟待保护。本研究采用SRAP分子标记技术,对10个居群的115份DNA样品进行PCR扩增,并开展遗传多样性分析。从81对引物中筛选出9个条带清晰、多态性好、重复性高的引物组合,共扩增得到305条谱带。在物种水平上,多态性比率（PPB）为100%,Nei’s基因多样性指数（H）为0.209 8,Shannon’s指数（I）为0.340 2;在居群水平上,PPB为24.59%～52.13%,H为0.079 6～0.165 5,I为0.120 9～0.252 3。居群水平上,基因分化度（Gst）为0.520 9,基因流（Nm）为0.459 9,遗传距离为0.091 9～0.198 4。UPGMA聚类结果表明,10个居群可分为3大类,地理距离相近的居群优先聚集。大花无柱兰的遗传多样性较为丰富,居群间存在一定的遗传分化和基因交流,可采用就地保护和人工栽培等方式加以保护。     

Product Gaussian Quadrature on Circular Lunes

Resorting to recent results on subperiodic trigonometric quadrature, we provide three product Gaussian quadrature formulas exact on algebraic polynomials of degree $n$ on circular lunes. The first works on any lune, and has $n^2 +\mathcal{O}(n)$ cardinality. The other two have restrictions on the lune angular intervals, but their cardinality is $n^2/2 +\mathcal{O}(n)$.     

A methodology for the development of discrete adjoint solvers using automatic differentiation tools

A methodology for the rapid development of adjoint solvers for computational fluid dynamics (CFD) models is presented. The approach relies on the use of automatic differentiation (AD) tools to almost completely automate the process of development of discrete adjoint solvers. This methodology is used to produce the adjoint code for two distinct 3D CFD solvers: a cell-centred Euler solver running in single-block, single-processor mode and a multi-block, multi-processor, vertex-centred, magneto-hydrodynamics (MHD) solver. Instead of differentiating the entire source code of the CFD solvers using AD, we have applied it selectively to produce code that computes the transpose of the flux Jacobian matrix and the other partial derivatives that are necessary to compute sensitivities using an adjoint method. The discrete adjoint equations are then solved using the Portable, Extensible Toolkit for Scientific Computation (PETSc) library. The selective application of AD is the principal idea of this new methodology, which we call the AD adjoint (ADjoint). The ADjoint approach has the advantages that it is applicable to any set of governing equations and objective functions and that it is completely consistent with the gradients that would be computed by exact numerical differentiation of the original discrete solver. Furthermore, the approach does not require hand differentiation, thus avoiding the long development times typically required to develop discrete adjoint solvers for partial differential equations, as well as the errors that result from the necessary approximations used during the differentiation of complex systems of conservation laws. These advantages come at the cost of increased memory requirements for the discrete adjoint solver. However, given the amount of memory that is typically available in parallel computers and the trends toward larger numbers of multi-core processors, this disadvantage is rather small when compared with the very significant advantages that are demonstrated. The sensitivities of drag and lift coefficients with respect to different parameters obtained using the discrete adjoint solvers show excellent agreement with the benchmark results produced by the complex-step and finite-difference methods. Furthermore, the overall performance of the method is shown to be better than most conventional adjoint approaches for both CFD solvers used.     

Product Identification and Mass Spectrometric Analysis of n-Butane and i-Butane Pyrolysis at Low Pressure

The pyrolysis of n-butane and i-butane at low pressure was investigated from 823-1823 K in an electrically heated flow reactor using synchrotron vacuum ultraviolet photoionization mass spectrometry. More than 20 species, especially several radicals and isomers, were detected and identified from the measurements of photoionization efficiency (PIE) spectra. Based on the mass spectrometric analysis, the characteristics of n-butane and i-butane pyrolysis were discussed, which provided experimental evidences for the discussion of decomposition pathways of butane isomers. It is concluded that the isomeric structures of n-butane and i-butane have strong influence on their main decomposition pathways, and lead to dramatic differences in their mass spectra and PIE spectra such as the different dominant products and isomeric structures of butene products. Furthermore, compared with n-butane, i-butane can produce strong signals of benzene at low temperature in its pyrolysis due to the enhanced formation of benzene precursors like propargyl and C4 species, which provides experimental clues to explain the higher sooting tendencies of iso-alkanes than n-alkanes.     

Influence of Isotope Effects on Product Polarizations of N(2D)+D2, N(2D)+H2 and N(2D)+HD Reactive Systems

To figure out the influence of isotope effect on product polarizations of the N(²D)+D₂ reactive system and its isotope variants, quasi-classical trajectory(QCT) calculation was performed on Ho’s potential energy surface(PES) of ²A″ state. Product polarizations such as product distributions of P(θ_r), P(φ_r) and P(θ_r,φ_r), as well as the generalized polarization-dependent differential cross sections(PDDCSs) were discussed and compared in detail among the four product channels of the title reactions. Both the intermolecular and intramolecular isotope effects were proved to be influential on product polarizations.     

基于边界值方法的微分动力系统数值计算方法

对高维非线性初值问题,微分求积法在每一步的积分过程中需要求解一个更高维的非线性方程组,因而计算量巨大。基于微分求积法与边界值方法两者之间的关系,可以将广义向后差分方法和扩展的隐式梯形积分方法看作是经典微分求积法的稀疏表达形式。将广义向后差分方法以及扩展的隐式梯形积分方法这两类边界值方法应用于微分动力系统的数值计算,提出了一类新的数值计算方法。理论分析及算例结果表明,对高维非线性微分初值问题的数值计算,本文方法相对于经典的微分求积法具有更高的计算效率。     

变量核奇异积分和分数次微分加权范不等式

用T和D^γ（0 ≤ γ ≤ 1）分别表示变量核奇异积分和分数次微分算子.T^*和T^#分别为T的共轭算子及拟共轭算子.利用球调和多项式展式，本文得到了TD^γ-D^γT和（T^*-T^#）D^γ在?^q，λ_ω（Rⁿ）上的有界性.同时也得到了变量核奇异积分的积T₁T₂和拟积T₁°T₂的加权范不等式.     

SUBMANIFOLDS OF PRODUCT RIEMANNIAN MANIFOLD

1IntroductionLetUandVbeRiemannianmanffolds,withthedimensionn1andn2respectively.UxVistheRiemannianproductofUandV.WedenotebyPandQtheprojectionmappingsofT(UxV)toTUaildTVrespectively.ThenwehaveWeputJ=P-Q.ItiseasytoseethatJ~=I.WedefineaRiemannianmetricofUxVbyg(X,Y)==g1(PX,PY) g2(QX,QY),wllereg1andg2areRiemannia11metricofUandVrespectively.ItfollowsthatBy7wedellotetheg'sLevi-Civitaconnection.ThenwecaneasilyseethatInfact,Frollltlledefillitiollofg,wecangetthatUalldVareallgeodesicsub…     

Truncated Newton method for sparse unconstrained optimization using automatic differentiation

When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986.     

Ample fields as a basis for possibilistic processes

Ample fields play an important role in possibility theory. These fields of subsets of a universe, which are additionally closed under arbitrary unions, act as the natural domains for possibility measures. A set provided with an ample field is then called an ample space. In this paper we generalise Wang's notions of product ample field and product ample space. We make a topological study of ample spaces and their products, and introduce ample subspaces, extensions and one-point extensions of ample spaces. In this way, a first step towards a mathematical theory of possibilistic processes is made.